New Firefly Algorithm based On Multi swarm & Learning Automata in Dynamic Environments

نویسندگان

  • Azam Amin Abshouri
  • Mohammad Reza Meybodi
  • Alireza Bakhtiary
چکیده

—Many real world problems are mostly time varying optimization problems, which require special mechanisms to detect changes in environment and then response to them. In this paper, combination of learning automata and firefly algorithm in order to improve the performance of firefly algorithm in dynamic environments has been proposed. In the algorithm, the firefly algorithm has been equipped with three learning automatons and velocity parameter, so they can increase diversity in response the dynamic environments. The main idea is based to split the population of fireflies into a set of interacting swarms. This Algorithm evaluated on a variety of instances of the multimodal dynamic moving peaks benchmark. Results are also compared with alternative approaches from the literature. They show that the new algorithm optimizer significantly outperforms previous approaches. Keywords-component; Dynamic Environment; Learning Automata; Multi Swarm; optimization methods & firefly Algorithm

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Optimized Firefly Algorithm based on Cellular Learning Automata for Community Detection in Social Networks

The structure of the community is one of the important features of social networks. A community is a sub graph which nodes have a lot of connections to nodes of inside the community and have very few connections to nodes of outside the community. The objective of community detection is to separate groups or communities that are linked more closely. In fact, community detection is the clustering...

متن کامل

A CELLULAR AUTOMATA BASED FIREFLY ALGORITHM FOR LAYOUT OPTIMIZAION OF TRUSS STRUCTURES

In this study an efficient meta-heuristic is proposed for layout optimization of truss structures by combining cellular automata (CA) and firefly algorithm (FA). In the proposed meta-heuristic, called here as cellular automata firefly algorithm (CAFA), a new equation is presented for position updating of fireflies based on the concept of CA. Two benchmark examples of truss structures are presen...

متن کامل

Introducing a new meta-heuristic algorithm based on See-See Partridge Chicks Optimization to solve dynamic optimization problems

The SSPCO (See-See Particle Chicks Optimization) is a type of swarm intelligence algorithm derived from the behavior of See-See Partridge. Although efficiency of this algorithm has been proven for solving static optimization problems, it has not yet been tested to solve dynamic optimization problems. Due to the nature of NP-Hard dynamic problems, this algorithm alone is not able to solve such o...

متن کامل

Improving Agent Performance for Multi-Resource Negotiation Using Learning Automata and Case-Based Reasoning

In electronic commerce markets, agents often should acquire multiple resources to fulfil a high-level task. In order to attain such resources they need to compete with each other. In multi-agent environments, in which competition is involved, negotiation would be an interaction between agents in order to reach an agreement on resource allocation and to be coordinated with each other. In recent ...

متن کامل

Some hybrid models to improve Firefly algorithm performance

Firefly algorithm is one of the evolutionary optimization algorithms, and is inspired by the behavior of fireflies in nature. Though efficient, its parameters do not change during iterations, which is also true for particle swarm optimization. This paper propose a hybrid model to improve the FA algorithm by introducing learning automata to adjust firefly behavior, and using genetic algorithm to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011